C++语言下, 关于图论算法的一些模版, 包括一般图最大匹配, km匹配, 最小割等等, 共15个模版,C++ language under the graph theory algorithm on a number of templates, including the maximum matching in general graph, km matching, minimum cut, etc., a total of 15 templates

A matching on a graph is a set of edges, no two of which share a vertex.

关于图论的一些算法和应用。 网络流、上下界网络流、km最佳匹配，弦图判定，一般图最大匹配，有向图最小生成树。-Some on the graph theory algorithms and applications. Network flows, network flow bounds, km best match the string diagram as to the general graph maximum matching, minimum spanning tree directed

ACM竞赛中 一般图的最大匹配 带花树-ACM contest the general graph maximum matching with trees and flowers. . . .

1.GeometricContext文件是完成图片中几何方向目标分类。 参考文献《Automatic Photo Pop-up》Hoiem 2005 2 GrabCut文件是完成图像中目标交互式分割 参考文献《“GrabCut” — Interactive Foreground Extraction using Iterated Graph Cuts》 C. Rother 2004 3 HOG文件是自己编写的根据HOG特征检测行人的matlab代码 4 虹膜识别程序